Square-free orders for CM elliptic curves modulo p

نویسندگان

  • Alina Carmen Cojocaru
  • A. C. Cojocaru
چکیده

Let E be an elliptic curve defined over Q, of conductor N , and with complex multiplication. We prove unconditional and conditional asymptotic formulae for the number of ordinary primes p ! N , p ≤ x , for which the group of points of the reduction of E modulo p has square-free order. These results are related to the problem of finding an asymptotic formula for the number of primes p for which the group of points of E modulo p is cyclic, first studied by Serre (1977). They are also related to the stronger problem about primitive points on E modulo p, formulated by Lang and Trotter (Bull Am Math Soc 83:289–292, 1977), and the one about the primality of the order of E modulo p, formulated by Koblitz [Pacific J. Math. 131(1):157–165, 1988]. Mathematics Subject Classification (2000) Primary 11G05; Secondary 11N36 · 11R45

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Square-free discriminants of Frobenius rings

Let E be an elliptic curve over Q. It is well known that the ring of endomorphisms of Ep, the reduction of E modulo a prime p of ordinary reduction, is an order of the quadratic imaginary field Q(πp) generated by the Frobenius element πp. When the curve has complex multiplication (CM), this is always a fixed field as the prime varies. However, when the curve has no CM, very little is known, not...

متن کامل

A Gross-Zagier formula for quaternion algebras over totally real fields

We prove a higher dimensional generalization of Gross and Zagier’s theorem on the factorization of differences of singular moduli. Their result is proved by giving a counting formula for the number of isomorphisms between elliptic curves with complex multiplication by two different imaginary quadratic fields K and K′, when the curves are reduced modulo a supersingular prime and its powers. Equi...

متن کامل

Choosing the correct elliptic curve in the CM method

We give an elementary way to distinguish between the twists of an ordinary elliptic curve E over Fp in order to identify the one with p+1−2U points, when p = U2 + dV 2 with 2U, 2V ∈ Z and E is constructed using the CM method for finding elliptic curves with a prescribed number of points. Our algorithms consist in most cases of reading off simple congruence conditions on U and V modulo 4.

متن کامل

On the asymptotics for invariants of elliptic curves modulo p

Let E be an elliptic curve defined over Q. Let E(Fp) denote the elliptic curve modulo p. It is known that there exist integers i p and f p such that E(Fp) ∼= Z/ i pZ × Z/ i p f pZ. We study questions related to i p and f p . In particular, for any α > 0 and k ∈ N, we prove there exist positive constants cα and ck such that for any A > 0 ∑ p≤x (log i p) α = cα li(x) + O ( x (log x)A ) and ∑ p≤x ...

متن کامل

Families of Fast Elliptic Curves from ℚ-curves

We construct new families of elliptic curves over Fp2 with efficiently computable endomorphisms, which can be used to accelerate elliptic curvebased cryptosystems in the same way as Gallant–Lambert–Vanstone (GLV) and Galbraith–Lin–Scott (GLS) endomorphisms. Our construction is based on reducing Q-curves—curves over quadratic number fields without complex multiplication, but with isogenies to th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010